1356. Sort Integers by The Number of 1 Bits - LeetCode Solution


Sort Bit Manipulation

Python Code:

class Solution:
    def sortByBits(self, arr: List[int]) -> List[int]:

        d = []

        for i in range(len(arr)):
            s = bin(arr[i])[2:]
            a = []
            
            count = s.count("1")

            a.append(count)
            a.append(arr[i])

            d.append(a)



        d.sort()

        q = []

        for i in range(len(d)):
            q.append(d[i][1])

        return q
        


Comments

Submit
0 Comments
More Questions

287A - IQ Test
1108A - Two distinct points
1064A - Make a triangle
1245C - Constanze's Machine
1005A - Tanya and Stairways
1663F - In Every Generation
1108B - Divisors of Two Integers
1175A - From Hero to Zero
1141A - Game 23
1401B - Ternary Sequence
598A - Tricky Sum
519A - A and B and Chess
725B - Food on the Plane
154B - Colliders
127B - Canvas Frames
107B - Basketball Team
245A - System Administrator
698A - Vacations
1216B - Shooting
368B - Sereja and Suffixes
1665C - Tree Infection
1665D - GCD Guess
29A - Spit Problem
1097B - Petr and a Combination Lock
92A - Chips
1665B - Array Cloning Technique
1665A - GCD vs LCM
118D - Caesar's Legions
1598A - Computer Game
1605A - AM Deviation